Prime Implicates and Reduced Implicate Tries
نویسندگان
چکیده
The reduced implicate trie (ri-trie) is a data structure that was introduced as a target language for knowledge compilation. It has the property that, even when large, it guarantees fast response to queries. It also has the property that each prime implicate of the formula it represents corresponds to a branch. In this paper, those prime branches are characterized, and a technique is developed for marking nodes to identify branches that correspond to non-prime implicates. This marking technique is enhanced to allow discovery of prime implicate subsets of queries that are answered affirmatively.
منابع مشابه
Prime Implicate Tries
The prime implicate trie (pi-trie) of a logical formula is a tree whose branches are labeled with the prime implicates of the formula. The technology of reduced implicate tries is employed to analyze the structure of pi-tries. Appropriate lemmas and theorems are proved, and an algorithm that builds the pi-trie from a logical formula is developed. Preliminary experimental results are presented.
متن کاملReduced Implicate/Implicant Tries
The reduced implicate trie, introduced in [10], is a data structure that may be used as a target language for knowledge compilation. It has the property that a query can be processed in time linear in the size of the query, regardless of the size of the compiled knowledge base. This data structure can be used with propositional databases, where a query amounts to asking whether a clause is an i...
متن کاملAbduction and prime implicates, from propositional logic to equational logic
Contents Motivations 4 1 State of the art for prime implicate generation in propositional logic 6 1.1 Abduction and prime implicates in propositional logic .
متن کاملTri-Based Set Operations and Selective Computation of Prime Implicates
A more efficient version of the prime implicate algorithm introduced in [12] that reduces the use of subsumption is presented. The algorithm is shown to be easily tuned to produce restricted sets of prime implicates. Experiments that illustrate these improvements are described.
متن کاملComputing prime implicates by pruning the search space and accelerating subsumption
The prime implicate trie (pi-trie) of a logical formula is a tree whose branches are labeled with the prime implicates of the formula. An algorithm that builds the pi-trie from a logical formula was introduced in [12]; it builds the trie recursively and makes extensive use of subsumption testing. A more efficient version in which the use of subsumption is reduced is presented in this paper. The...
متن کامل